全文获取类型
收费全文 | 2515篇 |
免费 | 327篇 |
国内免费 | 320篇 |
专业分类
化学 | 172篇 |
晶体学 | 1篇 |
力学 | 159篇 |
综合类 | 89篇 |
数学 | 1986篇 |
物理学 | 755篇 |
出版年
2024年 | 3篇 |
2023年 | 19篇 |
2022年 | 36篇 |
2021年 | 54篇 |
2020年 | 56篇 |
2019年 | 67篇 |
2018年 | 73篇 |
2017年 | 83篇 |
2016年 | 80篇 |
2015年 | 67篇 |
2014年 | 111篇 |
2013年 | 246篇 |
2012年 | 118篇 |
2011年 | 135篇 |
2010年 | 148篇 |
2009年 | 153篇 |
2008年 | 199篇 |
2007年 | 194篇 |
2006年 | 166篇 |
2005年 | 144篇 |
2004年 | 120篇 |
2003年 | 122篇 |
2002年 | 126篇 |
2001年 | 94篇 |
2000年 | 109篇 |
1999年 | 96篇 |
1998年 | 55篇 |
1997年 | 58篇 |
1996年 | 54篇 |
1995年 | 36篇 |
1994年 | 23篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 16篇 |
1990年 | 14篇 |
1989年 | 10篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有3162条查询结果,搜索用时 78 毫秒
21.
Mihajlo Cekić 《偏微分方程通讯》2017,42(11):1781-1836
In this paper, we consider the problem of identifying a connection ? on a vector bundle up to gauge equivalence from the Dirichlet-to-Neumann map of the connection Laplacian ?*? over conformally transversally anisotropic (CTA) manifolds. This was proved in [9] for line bundles in the case of the transversal manifold being simple—we generalize this result to the case where the transversal manifold only has an injective ray transform. Moreover, the construction of suitable Gaussian beam solutions on vector bundles is given for the case of the connection Laplacian and a potential, following the works of [11]. This in turn enables us to construct the Complex Geometrical Optics (CGO) solutions and prove our main uniqueness result. We also reduce the problem to a new non-abelian X-ray transform for the case of simple transversal manifolds and higher rank vector bundles. Finally, we prove the recovery of a flat connection in general from the DN map, up to gauge equivalence, using an argument relating the Cauchy data of the connection Laplacian and the holonomy. 相似文献
22.
23.
24.
25.
26.
Stability,periodicity, and symmetries of certain second‐order fractional difference equation with quadratic terms via KAM theory 下载免费PDF全文
Mirela Garić‐Demirović M. Nurkanović Z. Nurkanović 《Mathematical Methods in the Applied Sciences》2017,40(1):306-318
By using the Kolmogorov–Arnold–Moser theory, we investigate the stability of the equilibrium solution of the difference equation where A ,B ,D > 0,u ?1,u 0>0. We also use the symmetries to find effectively the periodic solutions with feasible periods. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
27.
In this paper, we study existence of invariant curves of an iterative equation which is from dissipative standard map. By constructing an invertible analytic solution g (x ) of an auxiliary equation of the form invertible analytic solutions of the form g (λ g ? 1(x )) for the original iterative functional equation are obtained. Besides the hyperbolic case 0 < |λ | < 1, we focus on those λ on the unit circle S 1, that is, |λ | = 1. We discuss not only those λ at resonance, that is, at a root of the unity, but also those λ near resonance under the Brjuno condition. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
28.
Existence of multiplicity harmonic and subharmonic solutions for second‐order quasilinear equation via Poincaré‐Birkhoff twist theorem 下载免费PDF全文
In this paper, we investigate the existence and multiplicity of harmonic and subharmonic solutions for second‐order quasilinear equation where , g satisfies the superlinear condition at infinity. We prove that the given equation possesses harmonic and subharmonic solutions by using the phase‐plane analysis methods and a generalized version of the Poincaré‐Birkhoff twist theorem. 相似文献
29.
Wen Qiang Shen 《数学学报(英文版)》2017,33(12):1587-1596
In this paper, we generalize Rees–Shishikura’s theorem to the class of geometrically finite rational maps. 相似文献
30.
《Discrete Mathematics》2023,346(1):113168
We present a simple algorithm that generates a cyclic 2-Gray code for ballot sequences. The algorithm generates each ballot sequence in constant amortized time using a linear amount of space. This is the first known cyclic 2-Gray code for ballot sequences that achieves this time bound. In addition, the algorithm can be easily modified to output ballot sequences in binary reflected Gray code order in constant amortized time per string using a linear amount of space. 相似文献